Search results for "Path relinking"

showing 3 items of 3 documents

A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem

2021

This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any demand point and its closest facility while balancing the workload among the facilities. An extensive computational experimentation is carried out to compare the performance of our proposal, including the best method found in the state-of-the-art as well as traditional multiobjective evolutionary algorithms.

Mathematical optimizationComputer scienceGeneral Mathematics0211 other engineering and technologiesEvolutionary algorithm02 engineering and technologyMulti-objective optimizationSet (abstract data type)path relinkingDiscrete optimization0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Center (algebra and category theory)multiobjective optimizationEngineering (miscellaneous)021103 operations researchOscillationlcsh:MathematicsWorkload<i>k</i>-balanced problemGreedy Randomized Adaptive Search Procedure (GRASP)lcsh:QA1-939strategic oscillationPath (graph theory)020201 artificial intelligence & image processingdiscrete optimization<i>k</i>-center problemMathematics
researchProduct

GRASP and path relinking for project scheduling under partially renewable resources

2008

[EN] Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and non-renewable resources. From an applied point of view, partially renewable resources allow us to model a large variety of situations that do not fit into classical models, but can be found in real problems in timetabling and labor scheduling. In this paper, we develop some preprocessing techniques and several heuristic algorithms for the problem. Preprocessing significantly reduces the dimension of the problems, therefore improving the efficiency of solution procedures. Heuristic algorithms based on GRASP an…

Mathematical optimizationInformation Systems and ManagementGeneral Computer Sciencebusiness.industryHeuristicComputer scienceGRASPESTADISTICA E INVESTIGACION OPERATIVAScheduling (production processes)Partially renewable resourcesSchedule (project management)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringProject management and schedulingScheduling (computing)Renewable energyModeling and SimulationGRASPHeuristicsPath relinkingProject managementbusinessHeuristicsRenewable resource
researchProduct

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics

2015

We consider the problem of scheduling a set of jobs on a set of identical parallel machines where the objective is to minimize the total weighted earliness and tardiness penalties with respect to a common due date. We propose a hybrid heuristic algorithm for constructing good solutions, combining priority rules for assigning jobs to machines and a local search with exact procedures for solving the one-machine subproblems. These solutions are then used in two metaheuristic frameworks, Path Relinking and Scatter Search, to obtain high quality solutions for the problem. The algorithms are tested on a large number of test instances to assess the efficiency of the proposed strategies. The result…

Parallel machinesMathematical optimizationGeneral Computer ScienceSchedulingTardinessESTADISTICA E INVESTIGACION OPERATIVAManagement Science and Operations ResearchScheduling (computing)Path RelinkingDue dateModeling and SimulationHybrid metaheuristicsScatter SearchMetaheuristicEarliness-tardinessMathematics
researchProduct